Sporadic Overtaking Optimality in Markov Decision Problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bias Optimality for Multichain Markov Decision Processes

In recent research we find that the policy iteration algorithm for Markov decision processes (MDPs) is a natural consequence of the performance difference formula that compares the difference of the performance of two different policies. In this paper, we extend this idea to the bias-optimal policy of MDPs. We first derive a formula that compares the biases of any two policies which have the sa...

متن کامل

Markov Decision Problems

Markov Decision Problems (MDPs) are the foundation for many problems that are of interest to researchers in Artificial Intelligence and Operations Research. In this paper, we will review what is known about algorithms for solving MDPs as well as the complexity of solving MDPs in general. We will argue that, even though there are theoretically efficient algorithms for solving MDPs, these algorit...

متن کامل

Variance minimization and the overtaking optimality approach to continuous-time controlled Markov chains

This paper deals with denumerable-state continuous-time controlled Markov chains with possibly unbounded transition and reward rates. It concerns optimality criteria that improve the usual expected average reward criterion. First, we show the existence of average reward optimal policies with minimal average variance. Then we compare the variance minimization criterion with overtaking optimality...

متن کامل

Risk-Sensitive and Mean Variance Optimality in Markov Decision Processes

In this note, we compare two approaches for handling risk-variability features arising in discrete-time Markov decision processes: models with exponential utility functions and mean variance optimality models. Computational approaches for finding optimal decision with respect to the optimality criteria mentioned above are presented and analytical results showing connections between the above op...

متن کامل

Blackwell Optimality in Markov Decision Processes with Partial Observation

We prove the existence of Blackwell ε-optimal strategies in finite Markov Decision Processes with partial observation. ∗Laboratoire d’Analyse Geometrie et Applications Institut Galilée, Université Paris Nord, avenue Jean Baptiste Clément, 93430 Villetaneuse, France. e-mail: [email protected] †Department of Managerial Economics and Decision Sciences, Kellogg School of Management, Northw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Dynamic Games and Applications

سال: 2016

ISSN: 2153-0785,2153-0793

DOI: 10.1007/s13235-016-0186-2